全文获取类型
收费全文 | 71159篇 |
免费 | 10986篇 |
国内免费 | 6625篇 |
专业分类
电工技术 | 11121篇 |
技术理论 | 2篇 |
综合类 | 7339篇 |
化学工业 | 5192篇 |
金属工艺 | 2162篇 |
机械仪表 | 6507篇 |
建筑科学 | 3077篇 |
矿业工程 | 2170篇 |
能源动力 | 3453篇 |
轻工业 | 3297篇 |
水利工程 | 1889篇 |
石油天然气 | 2695篇 |
武器工业 | 932篇 |
无线电 | 6592篇 |
一般工业技术 | 5583篇 |
冶金工业 | 1789篇 |
原子能技术 | 338篇 |
自动化技术 | 24632篇 |
出版年
2024年 | 344篇 |
2023年 | 1629篇 |
2022年 | 2892篇 |
2021年 | 3101篇 |
2020年 | 3362篇 |
2019年 | 2914篇 |
2018年 | 2573篇 |
2017年 | 3207篇 |
2016年 | 3510篇 |
2015年 | 3961篇 |
2014年 | 5559篇 |
2013年 | 5282篇 |
2012年 | 6076篇 |
2011年 | 6014篇 |
2010年 | 4285篇 |
2009年 | 4530篇 |
2008年 | 4143篇 |
2007年 | 4643篇 |
2006年 | 3759篇 |
2005年 | 3202篇 |
2004年 | 2652篇 |
2003年 | 2101篇 |
2002年 | 1782篇 |
2001年 | 1436篇 |
2000年 | 1168篇 |
1999年 | 835篇 |
1998年 | 746篇 |
1997年 | 611篇 |
1996年 | 456篇 |
1995年 | 441篇 |
1994年 | 351篇 |
1993年 | 251篇 |
1992年 | 209篇 |
1991年 | 166篇 |
1990年 | 135篇 |
1989年 | 111篇 |
1988年 | 76篇 |
1987年 | 32篇 |
1986年 | 35篇 |
1985年 | 24篇 |
1984年 | 22篇 |
1983年 | 24篇 |
1982年 | 23篇 |
1981年 | 12篇 |
1980年 | 22篇 |
1979年 | 19篇 |
1978年 | 11篇 |
1977年 | 7篇 |
1959年 | 5篇 |
1951年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 343 毫秒
61.
We consider robust knapsack problems where item weights are uncertain. We are allowed to query an item to find its exact weight,where the number of such queries is bounded by a given parameter Q. After these queries are made, we need to pack the items robustly, i.e., so that the choice of items is feasible for every remaining possible scenario of item weights.The central question that we consider is: Which items should be queried in order to gain maximum profit? We introduce the notion of query competitiveness for strict robustness to evaluate the quality of an algorithm for this problem, and obtain lower and upper bounds on this competitiveness for interval-based uncertainty. Similar to the study of online algorithms, we study the competitiveness under different frameworks, namely we analyze the worst-case query competitiveness for deterministic algorithms, the expected query competitiveness for randomized algorithms and the average case competitiveness for known distributions of the uncertain input data. We derive theoretical bounds for these different frameworks and evaluate them experimentally. We also extend this approach to Γ-restricted uncertainties introduced by Bertsimas and Sim.Furthermore, we present heuristic algorithms for the problem. In computational experiments considering both the interval-based and the Γ-restricted uncertainty, we evaluate their empirical performance. While the usage of a Γ-restricted uncertainty improves the nominal performance of a solution (as expected), we find that the query competitiveness gets worse. 相似文献
62.
为有效预测矿井内煤与瓦斯突出的危险程度,对其影响因素做了分析与探讨,分别构建了基于粒子群优化算法以及遗传算法支持向量机的煤与瓦斯突出预测模型,并且通过实例对两种模型预测的准确性进行了验证。分别利用单项以及综合指标、BP神经网络以及PSO-SVM模型、GA-SVM模型,对寺河煤矿二号井的突出区域进行预测比较。结果表明,PSO-SVM的预测模型不仅可以在小样本数据中预测出煤与瓦斯突出程度的大小,而且综合预测结果更加精确,其在解决矿井内煤与瓦斯突出的小样本数据中显示出更加强大、通用的性能。 相似文献
63.
The paper proposes a limit analysis approach to define the ultimate load capacity of orthotropic composite laminates under biaxial loading and plane stress conditions. A lower bound to the collapse load multiplier is computed by solving a maximization nonlinear problem, according to the static theorem of limit analysis. To set up the optimization problem a stress field distribution is hypothesized at lamina level, moreover inter-lamina stresses are also considered. The effectiveness and validity of the proposed approach is shown by comparing the obtained numerical predictions both with available experimental data and with other numerical results carried out by means of a different numerical lower bound approach. 相似文献
64.
65.
This paper investigates the N-policy M/M/1 queueing system with working vacation and server breakdowns. As soon as the system becomes empty, the server begins a working vacation. The server works at a lower service rate rather than completely stopping service during a vacation period. The server may break down with different breakdown rates during the idle, working vacation, and normal busy periods. It is assumed that service times, vacation times, and repair times are all exponentially distributed. We analyze this queueing model as a quasi-birth–death process. Furthermore, the equilibrium condition of the system is derived for the steady state. Using the matrix-geometric method, we find the matrix-form expressions for the stationary probability distribution of the number of customers in the system and system performance measures. The expected cost function per unit time is constructed to determine the optimal values of the system decision variables, including the threshold N and mean service rates. We employ the particle swarm optimization algorithm to solve the optimization problem. Finally, numerical results are provided, and an application example is given to demonstrate the applicability of the queueing model. 相似文献
66.
This paper considers a novel distributed iterative learning consensus control algorithm based on neural networks for the control of heterogeneous nonlinear multiagent systems. The system's unknown nonlinear function is approximated by suitable neural networks; the approximation error is countered by a robust term in the control. Two types of control algorithms, both of which utilize distributed learning laws, are provided to achieve consensus. In the provided control algorithms, the desired reference is considered to be an unknown factor and then estimated using the associated learning laws. The consensus convergence is proven by the composite energy function method. A numerical simulation is ultimately presented to demonstrate the efficacy of the proposed control schemes. 相似文献
67.
68.
To minimize the mass and increase the bearing failure load of composite doublelap bolted joints, a three-step optimization strategy including feasible region reduction,
optimization model decoupling and optimization was presented. In feasible region
reduction, the dimensions of the feasible design region were reduced by selecting dominant
design variables from numerous multilevel parameters by sensitivity analyses, and the
feasible regions of variables were reduced by influence mechanism analyses. In model
decoupling, the optimization model with a large number of variables was divided into
various sub-models with fewer variables by variance analysis. In the third step, the
optimization sub-models were solved one by one using a genetic algorithm, and the
modified characteristic curve method was adopted as the failure prediction method. Based
on the proposed optimization method, optimization of a double-lap single-bolt joint was
performed using the ANSYS® code. The results show that the bearing failure load increased
by 13.5% and that the mass decreased by 8.7% compared with those of the initial design of
the joint, which validated the effectiveness of the three-step optimization strategy. 相似文献
69.
针对多目标绿色柔性作业车间调度问题(MGFJSP)的特点,提出从碳排放量、噪声和废弃物这3个指标来综合评定环境污染程度,建立了以最小化最大完成时间和环境污染程度为优化目标的MGFJSP模型,并提出了一种改进的人工蜂群算法来求解该模型。算法的具体改进包括:设计了一种三维向量的编码和对应解码方案,在跟随蜂搜索阶段引入一种有效的动态邻域搜索操作来提高算法的局部搜索能力,在侦查蜂阶段提出产生新食物源的策略用于增加种群的多样性。最后进行了实验研究与算法对比,以验证所建模型和所提算法的有效性。 相似文献
70.
Hai Huang Haichao An Haibo Ma Shenyan Chen 《International journal for numerical methods in engineering》2019,117(3):291-315
This work presents an engineering method for optimizing structures made of bars, beams, plates, or a combination of those components. Corresponding problems involve both continuous (size) and discrete (topology) variables. Using a branched multipoint approximate function, which involves such mixed variables, a series of sequential approximate problems are constructed to make the primal problem explicit. To solve the approximate problems, genetic algorithm (GA) is utilized to optimize discrete variables, and when calculating individual fitness values in GA, a second-level approximate problem only involving retained continuous variables is built to optimize continuous variables. The solution to the second-level approximate problem can be easily obtained with dual methods. Structural analyses are only needed before improving the branched approximate functions in the iteration cycles. The method aims at optimal design of discrete structures consisting of bars, beams, plates, or other components. Numerical examples are given to illustrate its effectiveness, including frame topology optimization, layout optimization of stiffeners modeled with beams or shells, concurrent layout optimization of beam and shell components, and an application in a microsatellite structure. Optimization results show that the number of structural analyses is dramatically decreased when compared with pure GA while even comparable to pure sizing optimization. 相似文献